On Minimal Support for Lattices and Semigroups
Coloring the Voronoi Tesselation of Lattices
PPP-completeness with connections to Cryptography
Successive Minima-Type Inequalities
A Reverse Minkowski Theorem
New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
When Cryptography Meets Modern Channel Coding
New Bounds on the Covering Density
Provable Sieving Algorithms for SVP and CVP in the l_p norm
Challenges in Evaluating Costs of known Lattice Attacks
Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes
On the Concrete Security of LWE with Small Secret
A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms
Short Simplex Paths in Lattice Polytopes
Lattice Packings: An Upper Bound on the Number of Perfect Lattices
On Approximating the Covering Radius and Finding Dense Lattice Subspaces
An LLL Algorithm for Module Lattices
Algorithms for the k-List Problems
The n by n by n Cube and a Hyperplane